Oblivious Conjunctive Keyword Search

نویسندگان

  • Hyun Sook Rhee
  • Jin Wook Byun
  • Dong Hoon Lee
  • Jongin Lim
چکیده

We study the problem of keyword search in which a server contains various multimedia contents and a user of server wishes to retrieve some multimedia item containing specific keywords without revealing to the server which item it is. Recently, Ogata and Kurosawa introduced an interesting keyword search scheme called oblivious keyword search by using the notion of oblivious transfer. However, only one keyword can be searched in each query, hence the scheme cannot provide a conjunctive keyword search which finds items containing each of several keywords. In this paper, we firstly design a conjunctive keyword search by using the oblivious transfer, and present oblivious conjunctive keyword search (for short, OCKS). We prove that OCKS protocol is secure under the intractability of RSA known target inversion problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Privacy-Aware Relevant Data Access with Semantically Enriched Search Queries for Untrusted Cloud Storage Services

Privacy-aware search of outsourced data ensures relevant data access in the untrusted domain of a public cloud service provider. Subscriber of a public cloud storage service can determine the presence or absence of a particular keyword by submitting search query in the form of a trapdoor. However, these trapdoor-based search queries are limited in functionality and cannot be used to identify se...

متن کامل

Conjunctive Keyword Search on Encrypted Data with Completeness and Computational Privacy

We introduce mechanisms for secure keyword searches on a document server. We propose protocols with computational privacy, query correctness assurances and minimal or no leaks: the server either correctly executes client queries or (if it behaves maliciously) is immediately detected. The client is then provided with strong assurances proving the authenticity and completeness of server replies. ...

متن کامل

On a security model of conjunctive keyword search over encrypted relational database

We study a security model for searching documents containing each of several keywords (conjunctive keyword search) over encrypted documents. A conjunctive keyword search protocol consists of three entities: a data supplier, a storage system such as database, and a user of storage system. A data supplier uploads encrypted documents on a storage system, and then a user of the storage system searc...

متن کامل

A New Public Key Encryption with Conjunctive Field Keyword Search Scheme

The scheme that searching over the encrypted data, which is also named conjunctive keyword searchable scheme, enables one to search the encrypted data by using conjunctive keywords. The concept was first presented by Golle et al., and then Park et al. extended their scheme into a public key system. According to the existing conjunctive keyword searchable schemes and the assumption that Golle et...

متن کامل

Public Key Encryption with Conjunctive Field Free Keyword Search Scheme

Searchable encryption allows a remote server to search over encrypted documents without knowing the sensitive data contents. Prior searchable symmetric encryption schemes focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes improve system usability by retrieving the matched documents. In this type of search, the user has to repeatedly perform the search protocol for many t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005